State Space Reductions for Alternating Büchi Automata Quotienting by Simulation Equivalences
نویسندگان
چکیده
Quotienting by simulation equivalences is awell-established technique for reducing the size of nondeterministic Büchi automata.We adapt this technique to alternating Büchi automata. To this end we suggest two new quotients, namely minimax and semi-elective quotients, prove that they preserve the recognized languages, and show that computing them is not more difficult than computing quotients for nondeterministic Büchi automata. We explain the merits of of our quotienting procedures with respect to converting alternating Büchi automata into nondeterministic ones.
منابع مشابه
Generalized simulation relations with applications in automata theory
Finite-state automata are a central computational model in computer science, with numerous and diverse applications. In one such application, viz. model-checking, automata over infinite words play a central rôle. In this thesis, we concentrate on Büchi automata (BA), which are arguably the simplest finite-state model recognizing languages of infinite words. Two algorithmic problems are paramoun...
متن کاملExplorer Reduction of Nondeterministic Tree Automata
We present an efficient algorithm to reduce the size of nondeterministic tree automata, while retaining their language. It is based on new transition pruning techniques, and quotienting of the state space w.r.t. suitable equivalences. It uses criteria based on combinations of downward and upward simulation preorder on trees, and the more general downward and upward language inclusions. Since tr...
متن کاملReduction of Nondeterministic Tree Automata
We present an efficient algorithm to reduce the size of nondeterministic tree automata, while retaining their language. It is based on new transition pruning techniques, and quotienting of the state space w.r.t. suitable equivalences. It uses criteria based on combinations of downward and upward simulation preorder on trees, and the more general downward and upward language inclusions. Since tr...
متن کاملMultipebble Simulations for Alternating Automata
We study generalized simulation relations for alternating Büchi automata (ABA), as well as alternating finite automata. Having multiple pebbles allows the Duplicator to “hedge her bets” and delay decisions in the simulation game, thus yielding a coarser simulation relation. We define (k1, k2)-simulations, with k1/k2 pebbles on the left/right, respectively. This generalizes previous work on ordi...
متن کاملSimulations and Antichains for Efficient Handling of Finite Automata
This thesis is focused on techniques for finite automata and their use in practice, with the main emphasis on nondeterministic tree automata. This concerns namely techniques for size reduction and language inclusion testing, which are two problems that are crucial for many applications of tree automata. For size reduction of tree automata, we adapt the simulation quotient technique that is well...
متن کامل